منابع مشابه
Combining Graph Labeling and Compaction
Combinations of graph drawing and map labeling problems yield challenging mathematical problems and have direct applications, e.g., in automation engineering. We call graph drawing problems in which subsets of vertices and edges need to be labeled graph labeling problems. Unlike in map labeling where the position of the objects is specified in the input, the coordinates of vertices and edges in...
متن کاملPredicated Instructions for Code Compaction
Procedural abstraction, the replacement of several identical code sequences with calls to a single representative function, is a powerful tool in producing compact executables. We explore how predicated instructions can be used to allow procedural abstraction of non-identical basic blocks. A predicated instruction is one that the processor executes if a condition (specified in the opcode) is tr...
متن کاملCode Compaction Using Genetic Algorithms
One method for compacting executable computer code is to replace commonly repeated sequences of instructions with macro instructions from a decoding dictionary. The size of the decoding dictionary is often small in comparison to the number of all possible macros. Choosing the macros that yield the best compaction is a di cult subset selection problem because multiple, but colliding, macros may ...
متن کاملCombining State Space Caching and Hash Compaction
In veri cation by explicit state enumeration, for each reachable state the full state descriptor is stored in a state table. Two methods { state space caching and hash compaction { that reduce the memory requirements for this table have been proposed in the literature. In state space caching, \old" states are replaced by newly reached ones once the table lls up, which might increase the run-tim...
متن کاملFlat Combining Synchronized Global Data Structures
The implementation of scalable synchronized data structures is notoriously difficult. Recent work in shared-memory multicores introduced a new synchronization paradigm called flat combining that allows many concurrent accessors to cooperate efficiently to reduce contention on shared locks. In this work we introduce this paradigm to a domain where reducing communication is paramount: distributed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2001
ISSN: 0362-1340,1558-1160
DOI: 10.1145/384196.384204